Maltsev + Datalog --> Symmetric Datalog
نویسندگان
چکیده
Let B be a finite, core relational structure and let A be the algebra associated to B, i.e. whose terms are the operations on the universe of B that preserve the relations of B. We show that if A generates a so-called arithmetical variety then CSP(B), the constraint satisfaction problem associated to B, is solvable in Logspace; in fact ¬CSP(B) is expressible in symmetric Datalog. In particular, we obtain that if ¬CSP(B) is expressible in Datalog and the relations of B are invariant under a Maltsev operation then ¬CSP(B) is in symmetric
منابع مشابه
On Constraint Satisfaction Problems below P
Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in logarithmic space [10]. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Datalog is an important task. A simple, well-known fact is that for any CSP, a fixed set of structures O (an obstruction set) ca...
متن کامل$n$-permutability and linear Datalog implies symmetric Datalog
In the last decade, algebraic methods have led to much progress in classifying the complexity of the non-uniform Constraint Satisfaction Problem (CSP). The programming language Datalog, whose origins lie in logic programming and database theory, has been playing an important role in classifying complexity of CSP since at least the classic paper of Feder and M. Vardi [10]. Feder and Vardi used D...
متن کاملDirected st-Connectivity Is Not Expressible in Symmetric Datalog
We show that the directed st-connectivity problem cannot be expressed in symmetric Datalog, a fragment of Datalog introduced in [5]. It was shown there that symmetric Datalog programs can be evaluated in logarithmic space and that this fragment of Datalog captures logspace when augmented with negation, and an auxiliary successor relation S together with two constant symbols for the smallest and...
متن کاملThe Complexity of Constraint Satisfaction Problems and Symmetric Datalog
Constraint satisfaction problems (CSPs) provide a unified framework for studying a wide variety of computational problems naturally arising in combinatorics, artificial intelligence and database theory. To any finite domain D and any constraint language Γ (a finite set of relations over D), we associate the constraint satisfaction problem CSP(Γ): an instance of CSP(Γ) consists of a list of vari...
متن کاملRapport de stage de recherche Complexity of Decision Problems in Computational Logic RAPPORT NON CONFIDENTIEL
This report presents the study of algorithms whose goal is to determine whether two Datalog programs are equivalent. Datalog is a query language used over deductive databases. Datalog is a fragment of Prolog, and consists in Horn clauses without function symbols. In general, it is undecidable whether two given Datalog programs are equivalent one to each other; however, this problem becomes deci...
متن کامل